Complexity theory

Results: 3600



#Item
121Analysis of algorithms / Computational complexity theory / Theory of computation / Mathematics / Balls into bins / With high probability / Sorting algorithm / Leader election / Time complexity / Entropy / Best /  worst and average case / Big O notation

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
122Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / FO / Mathematics / Computer science / Theoretical computer science / Analytic geometry

Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions Pankaj K. Agarwaly Micha Sharirz

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2012-06-29 10:27:51
123Finite model theory / FO / IP / Symbol / Base / Mathematics / Creativity

The complexity of positive first-order logic without equality FLORENT MADELAINE Clermont Universit, Universit d’Auvergne, LIMOS. CNRS, UMR 6158, LIMOS. and

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-01-14 21:47:14
124Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Graph / Travelling salesman problem / Vertex / Cycle / Hamiltonian path / Graph automorphism / Vertex cover

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: comopt.ifi.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
125Parallel computing / Computer science / Computational complexity theory / Computational geometry / Randomized algorithm / Sweep line algorithm / Polyhedron / Mathematics / Spanning tree / Hidden line removal / Arrangement of lines

UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll

Add to Reading List

Source URL: mapcontext.com

Language: English
126Mathematics / Algebra / Abstract algebra / Computer algebra / Polynomials / Group theory / Resultant / Finite field / Regular chain / Elliptic curve / Time complexity / RSA

Modular composition modulo triangular sets and applications ´ Adrien Poteaux† ? Eric Schost†

Add to Reading List

Source URL: www.csd.uwo.ca

Language: English - Date: 2011-11-11 00:13:36
127Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / Matching / Flow network / 3-dimensional matching / Vertex cover

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
128Computational complexity theory / Graph theory / Mathematics / Phylogenetics / NP-complete problems / Computational phylogenetics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Steiner tree problem / Algorithm / Maximum parsimony

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:54
129Algebra / Mathematics / Linear algebra / Matrix theory / Determinant / Morphism of algebraic varieties / Skew-symmetric matrix / Matrix / Algebraic curve / Semi-invariant of a quiver

HYPERSURFACES WITH DEGENERATE DUALS AND THE GEOMETRIC COMPLEXITY THEORY PROGRAM J.M. LANDSBERG, LAURENT MANIVEL AND NICOLAS RESSAYRE Abstract. We determine set-theoretic defining equations for the variety Dualk,d,N ⊂ P

Add to Reading List

Source URL: www.math.tamu.edu

Language: English - Date: 2010-04-27 09:25:58
130Mathematical optimization / Mathematics / Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational complexity theory / Submodular set function / Randomized rounding / Optimization problem / Matroid / Ellipsoid method

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

Add to Reading List

Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

Language: English - Date: 2012-07-04 18:28:36
UPDATE